Model-checking Inherently Fair Linear-time Properties

The concept of linear-time verification with an inherent fairness condition has been studied under the names approximate satisfaction, satisfaction up to liveness, and satisfaction within fairness in several publications. Even though proving the general applicability of the approach, reasonably efficient algorithms for inherently fair linear-time verification (IFLTV) are lacking. This paper bridges the gap between the theoretical foundation of IFLTV and its practical application, presenting a model-checking algorithm based on a structural analysis of the synchronous product of the system and property (Büchi) automata.